Quadratic reformulations of nonlinear binary optimization problems
نویسندگان
چکیده
منابع مشابه
Quadratic reformulations of nonlinear binary optimization problems
Very large nonlinear unconstrained binary optimization problems arise in a broad array of applications. Several exact or heuristic techniques have proved quite successful for solving many of these problems when the objective function is a quadratic polynomial. However, no similarly efficient methods are available for the higher degree case. Since high degree objectives are becoming increasingly...
متن کاملInner Approximations of Completely Positive Reformulations of Mixed Binary Quadratic Optimization Problems: A Unified Analysis∗
August 24, 2015 Abstract Every quadratic optimization problem with a mix of continuous and binary variables can be equivalently reformulated as a completely positive optimization problem, i.e., a linear optimization problem over the convex but computationally intractable cone of completely positive matrices. In this paper, we focus on general inner approximations of the cone of completely posit...
متن کاملStandard bi-quadratic optimization problems and unconstrained polynomial reformulations
A so-called Standard Bi-Quadratic Optimization Problem (StBQP) consists in minimizing a bi-quadratic form over the Cartesian product of two simplices (so this is different from a Bi-Standard QP where a quadratic function is minimized over the same set). An application example arises in portfolio selection. In this paper we present a bi-quartic formulation of StBQP, in order to get rid of the si...
متن کاملRobust Optimization of Unconstrained Binary Quadratic Problems
In this paper we focus on the unconstrained binary quadratic optimization model, maximize xQx, x binary, and consider the problem of identifying optimal solutions that are robust with respect to perturbations in the Q matrix.. We are motivated to find robust, or stable, solutions because of the uncertainty inherent in the big data origins of Q and limitations in computer numerical precision, pa...
متن کاملUnconstrained Optimization Reformulations of Variational Inequality Problems
Recently, Peng considered a merit function for the variational inequality problem (VIP), which constitutes an unconstrained di erentiable optimization reformulation of VIP. In this paper, we generalize the merit function proposed by Peng and study various properties of the generalized function. We call this function the D-gap function. We give conditions under which any stationary point of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2016
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-016-1032-4